<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>LibCDS: BinaryTree Struct Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">LibCDS
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.6 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Data&#160;Structures</span></a></li>
      <li><a href="functions.html"><span>Data&#160;Fields</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('structBinaryTree.html','');});
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#pub-attribs">Data Fields</a>  </div>
  <div class="headertitle">
<div class="title">BinaryTree Struct Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p>The implementation for basic binary search tree.  
 <a href="structBinaryTree.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Data Fields</h2></td></tr>
<tr class="memitem:a3e6c672699b619925f1923c2ff7a8ee1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="binary__tree_8h.html#a28cc052d6379d1caedfebea6585de45c">BinTreeData</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a3e6c672699b619925f1923c2ff7a8ee1">pData</a></td></tr>
<tr class="memdesc:a3e6c672699b619925f1923c2ff7a8ee1"><td class="mdescLeft">&#160;</td><td class="mdescRight">The container private information.  <a href="#a3e6c672699b619925f1923c2ff7a8ee1">More...</a><br/></td></tr>
<tr class="separator:a3e6c672699b619925f1923c2ff7a8ee1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9b475f636827530f5ce323bd88a2d162"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a9b475f636827530f5ce323bd88a2d162">insert</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>)</td></tr>
<tr class="memdesc:a9b475f636827530f5ce323bd88a2d162"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert an item into the tree.  <a href="#a9b475f636827530f5ce323bd88a2d162">More...</a><br/></td></tr>
<tr class="separator:a9b475f636827530f5ce323bd88a2d162"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0c2f371b8aa3bd9e730f8fe4601d9acb"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a0c2f371b8aa3bd9e730f8fe4601d9acb">search</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a0c2f371b8aa3bd9e730f8fe4601d9acb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Search for the item having the same order with the designated one.  <a href="#a0c2f371b8aa3bd9e730f8fe4601d9acb">More...</a><br/></td></tr>
<tr class="separator:a0c2f371b8aa3bd9e730f8fe4601d9acb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a76257086e01aa9b48f9968b4e66895bf"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a76257086e01aa9b48f9968b4e66895bf">delete</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>)</td></tr>
<tr class="memdesc:a76257086e01aa9b48f9968b4e66895bf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Delete the item having the same order with the designated one.  <a href="#a76257086e01aa9b48f9968b4e66895bf">More...</a><br/></td></tr>
<tr class="separator:a76257086e01aa9b48f9968b4e66895bf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a10a684bbaa5b34d0a15890a2aee60ffe"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a10a684bbaa5b34d0a15890a2aee60ffe">maximum</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a10a684bbaa5b34d0a15890a2aee60ffe"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the item having the maximum order of the tree.  <a href="#a10a684bbaa5b34d0a15890a2aee60ffe">More...</a><br/></td></tr>
<tr class="separator:a10a684bbaa5b34d0a15890a2aee60ffe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a95a6a52ed221d9444a21b4c2da5fad8f"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a95a6a52ed221d9444a21b4c2da5fad8f">minimum</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a95a6a52ed221d9444a21b4c2da5fad8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the item having the minimum order of the tree.  <a href="#a95a6a52ed221d9444a21b4c2da5fad8f">More...</a><br/></td></tr>
<tr class="separator:a95a6a52ed221d9444a21b4c2da5fad8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a723a282fba28501431363ed7f812f132"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a723a282fba28501431363ed7f812f132">successor</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a723a282fba28501431363ed7f812f132"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the immediate successor of the designated item.  <a href="#a723a282fba28501431363ed7f812f132">More...</a><br/></td></tr>
<tr class="separator:a723a282fba28501431363ed7f812f132"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6be4b315f0886dfaebc6d9fd939c0f29"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a6be4b315f0886dfaebc6d9fd939c0f29">predecessor</a> )(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td></tr>
<tr class="memdesc:a6be4b315f0886dfaebc6d9fd939c0f29"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the immediate predecessor of the designated item.  <a href="#a6be4b315f0886dfaebc6d9fd939c0f29">More...</a><br/></td></tr>
<tr class="separator:a6be4b315f0886dfaebc6d9fd939c0f29"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a884db85820f1a1e84ee1868012b60e2f"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a884db85820f1a1e84ee1868012b60e2f">size</a> )(struct _BinaryTree *)</td></tr>
<tr class="memdesc:a884db85820f1a1e84ee1868012b60e2f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the number of stored item.  <a href="#a884db85820f1a1e84ee1868012b60e2f">More...</a><br/></td></tr>
<tr class="separator:a884db85820f1a1e84ee1868012b60e2f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0857815b9ce9b2fe2adf46284008a30d"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a0857815b9ce9b2fe2adf46284008a30d">set_compare</a> )(struct _BinaryTree *, int32_t(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td></tr>
<tr class="memdesc:a0857815b9ce9b2fe2adf46284008a30d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the user defined item comparison method.  <a href="#a0857815b9ce9b2fe2adf46284008a30d">More...</a><br/></td></tr>
<tr class="separator:a0857815b9ce9b2fe2adf46284008a30d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4d77253f166277773bd851ce43caace4"><td class="memItemLeft" align="right" valign="top">int32_t(*&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="structBinaryTree.html#a4d77253f166277773bd851ce43caace4">set_destroy</a> )(struct _BinaryTree *, void(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td></tr>
<tr class="memdesc:a4d77253f166277773bd851ce43caace4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Set the user defined item clean method.  <a href="#a4d77253f166277773bd851ce43caace4">More...</a><br/></td></tr>
<tr class="separator:a4d77253f166277773bd851ce43caace4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>The implementation for basic binary search tree. </p>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00014">14</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>
</div><h2 class="groupheader">Field Documentation</h2>
<a class="anchor" id="a3e6c672699b619925f1923c2ff7a8ee1"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="binary__tree_8h.html#a28cc052d6379d1caedfebea6585de45c">BinTreeData</a>* BinaryTree::pData</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>The container private information. </p>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00016">16</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a9b475f636827530f5ce323bd88a2d162"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::insert)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Insert an item into the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#a65a05471b7ff1b28de6ab994656005e5" title="Insert an item into the tree. ">BinTreeInsert</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00020">20</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a0c2f371b8aa3bd9e730f8fe4601d9acb"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::search)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Search for the item having the same order with the designated one. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#abbf46d14f78993191392b966828fdb2b" title="Search for the item having the same order with the designated one. ">BinTreeSearch</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00024">24</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a76257086e01aa9b48f9968b4e66895bf"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::delete)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Delete the item having the same order with the designated one. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#ae1e25eb0b7cc9dd1f48ebd603bef90fa" title="Delete the item having the same order with the designated one. ">BinTreeDelete</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00028">28</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a10a684bbaa5b34d0a15890a2aee60ffe"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::maximum)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the item having the maximum order of the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#aee8860e4695a5b5807721da22a3b748a" title="Return the item having the maximum order of the tree. ">BinTreeMaximum</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00032">32</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a95a6a52ed221d9444a21b4c2da5fad8f"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::minimum)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the item having the minimum order of the tree. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#a8a63bca7f686e0268c9ad78dc325a2d0" title="Return the item having the minimum order of the tree. ">BinTreeMinimum</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00036">36</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a723a282fba28501431363ed7f812f132"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::successor)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the immediate successor of the designated item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#a36e93f5a76a11db0d187f7f167d1ebcb" title="Return the item which is the immediate successor of the designated item. ">BinTreeSuccessor</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00040">40</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a6be4b315f0886dfaebc6d9fd939c0f29"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::predecessor)(struct _BinaryTree *, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a> *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the immediate predecessor of the designated item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#a9879de28c30d94c40d3c8a476879716c" title="Return the item which is the immediate predecessor of the designated item. ">BinTreePredecessor</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00044">44</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a884db85820f1a1e84ee1868012b60e2f"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::size)(struct _BinaryTree *)</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Get the number of stored item. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#ab424ccf5559abc14a13f79bfba777e28" title="Return the number of stored items. ">BinTreeSize</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00048">48</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a0857815b9ce9b2fe2adf46284008a30d"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::set_compare)(struct _BinaryTree *, int32_t(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>, <a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Set the user defined item comparison method. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#ab807f7884ec935ea00b572535ac1826a" title="Set the custom item comparison method. ">BinTreeSetCompare</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00052">52</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
<a class="anchor" id="a4d77253f166277773bd851ce43caace4"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int32_t(* BinaryTree::set_destroy)(struct _BinaryTree *, void(*)(<a class="el" href="util_8h.html#a2583da5c1c14184068bda8cf681d5bed">Item</a>))</td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Set the user defined item clean method. </p>
<dl class="section see"><dt>See Also</dt><dd><a class="el" href="binary__tree_8h.html#a326e9e8fe0ab19d8d5b59217eebe42ca" title="Set the custom item resource clean method. ">BinTreeSetDestroy</a> </dd></dl>

<p>Definition at line <a class="el" href="binary__tree_8h_source.html#l00056">56</a> of file <a class="el" href="binary__tree_8h_source.html">binary_tree.h</a>.</p>

</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="structBinaryTree.html">BinaryTree</a></li>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
